COMPARING SEARCHING AND SORTING ALGORITHMS EFFICIENCY IN IMPLEMENTING COMPUTATIONAL EXPERIMENT IN PROGRAMMING ENVIRONMENT

Efficient Sorting and Searching in Rendering Algorithms

In the proposed tutorial we would like to highlight the connection between rendering algorithms and sorting and searching as classical problems studied in computer science. We will provide both theoretical and empirical evidence that for many rendering techniques most time is spent by sorting and searching. In particular we will discuss problems and solutions for visibility computation, density...

Striving for Efficiency in Algorithms: Sorting

Sorting is the fundamental algorithmic problem in computer science. It is the first step in solving many other algorithmic problems. Donald Knuth, a world famous computer scientist and author of the book “The Art of Computer Programming, Volume 3: Sorting and Searching”, wrote: “I believe that virtually every important aspect of programming arises somewhere in the context of searching or sorting”.

Implementing and Comparing Stochastic and Robust Programming

Implementing Randomised Algorithms in Constraint Logic Programming

Synopsis Algorithms where the ow of information is determined by an element of random choice (a \coin ipping" device), aka randomised algorithms, have known in the last decade a tremendous growth of interest, especially in the eld of complexity theory. Up to now such algorithms have been implemented mostly by means of probabilistic programs written in imperative languages. These programs have b...

Implementing and Comparing Integer Factorization Algorithms

Integer factorization is an important problem in modern cryptography as it is the basis of RSA encryption. I have implemented two integer factorization algorithms: Pollard’s rho algorithm and Dixon’s factorization method. While the results are not revolutionary, they illustrate the software design difficulties inherent to integer factorization. The code for this project is available at https://...